Benchmark graphs for testing community detection algorithms
نویسندگان
چکیده
منابع مشابه
Benchmark graphs for testing community detection algorithms.
Community structure is one of the most important features of real networks and reveals the internal organization of the nodes. Many algorithms have been proposed but the crucial issue of testing, i.e., the question of how good an algorithm is, with respect to others, is still open. Standard tests include the analysis of simple artificial graphs with a built-in community structure, that the algo...
متن کاملHierarchical benchmark graphs for testing community detection algorithms
Hierarchical organization is an important, prevalent characteristic of complex systems; to understand their organization, the study of the underlying (generally complex) networks that describe the interactions between their constituents plays a central role. Numerous previous works have shown that many real-world networks in social, biologic, and technical systems present hierarchical organizat...
متن کاملTowards realistic artificial benchmark for community detection algorithms evaluation
Many algorithms have been proposed for revealing the community structure in complex networks. Tests under a wide range of realistic conditions must be performed in order to select the most appropriate for a particular application. Artificially generated networks are often used for this purpose. The most realistic generative method to date has been proposed by Lancichinetti, Fortunato and Radicc...
متن کاملBenchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.
Many complex networks display a mesoscopic structure with groups of nodes sharing many links with the other nodes in their group and comparatively few with nodes of different groups. This feature is known as community structure and encodes precious information about the organization and the function of the nodes. Many algorithms have been proposed but it is not yet clear how they should be test...
متن کاملOn converting community detection algorithms for fuzzy graphs in Neo4j
An essential feature of large scale free graphs, such as the Web, protein-to-protein interaction, brain connectivity, and social media graphs, is that they tend to form recursive communities. The latter are densely connected vertex clusters exhibiting quick local information dissemination and processing. Under the fuzzy graph model vertices are fixed while each edge exists with a given probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.78.046110